Triangulating Planar Graphs While Keeping the Pathwidth Small
نویسنده
چکیده
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without increasing the pathwidth by much. We show that if a planar graph has pathwidth k, then we can triangulate it so that the resulting graph has pathwidth O(k) (where the factors are 1, 8 and 16 for 3-connected, 2-connected and arbitrary graphs). With similar techniques, we also show that any outer-planar graph of pathwidth k can be turned into a maximal outer-planar graph of pathwidth at most 4k + 4. The previously best known result here was 16k + 15.
منابع مشابه
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete ...
متن کامل2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl [1], in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two dimensional grid. In conjunction...
متن کاملComplexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes
A path in a vertex-colored graph G is vertex rainbow if all of its internal vertices have a distinct color. The graph G is said to be rainbow vertex connected if there is a vertex rainbow path between every pair of its vertices. Similarly, the graph G is strongly rainbow vertex connected if there is a shortest path which is vertex rainbow between every pair of its vertices. We consider the comp...
متن کاملOn triangulating k-outerplanar graphs
A k-outerplanar graph is a graph that can be drawn in the plane without crossing such that after k-fold removal of the vertices on the outer-face there are no vertices left. In this paper, we study how to triangulate a k-outerplanar graph while keeping its outerplanarity small. Specifically, we show that not all k-outerplanar graphs can be triangulated so that the result is k-outerplanar, but t...
متن کامل